How to compute the Area of Feasible Solutions

نویسندگان

  • M. Sawall
  • K. Neymeyr
چکیده

The area of feasible solutions (AFS) is a low dimensional representation of the set of all possible nonnegative factorizations of a given spectral data matrix. The AFS can be used to investigate the so-called rotational ambiguity of MCR methods in chemometrics, and the AFS is an excellent starting point for feeding in additional information on the chemical reaction system in order to reduce the ambiguity up to a unique factorization. The FAC-PACK program package is a freely available and easy-to-use Matlab toolbox (with a core written in C and FORTRAN) for the numerical AFS computation for twoand three-component systems. The numerical algorithm of FAC-PACK is based on the inflation of polygons and allows a stable and fast computation of the AFS. In this contribution we explain all functionalities of the FAC-PACK software and demonstrate its application to a consecutive reaction system with three components.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separable programming problems with the max-product fuzzy relation equation constraints

In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...

متن کامل

Stochastic Facility Layout Planning Problem: A Metaheuristic and Case Study

Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

How can Small Rural Businesses with Emphasis on Entrepreneurship be promoted?

While promoting rural economic enterprises and businesses can contribute to create and strengthen entrepreneurship, this as a crucial strategy will accelerate rural development process. Through extending these businesses and strengthening entrepreneurship among rural people proper solutions can be found to combine resources both inside and outside the village. It can also assist to provide both...

متن کامل

UNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS

In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015